Ordered Landmarks in Planning
نویسندگان
چکیده
منابع مشابه
Ordered Landmarks in Planning
Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and to use them for guiding search, in the hope of speeding up the planning process. We go beyond the previous approaches by considering ordering constraints not only over the (top-level) goals, but also over the sub-...
متن کاملLandmarks in Hierarchical Planning
In this paper we introduce a novel landmark technique for hierarchical planning. Landmarks are abstract tasks that are mandatory. They have to be performed by any solution plan. Our technique relies on a landmark extraction procedure that pre-processes a given planning problem by systematically analyzing the ways in which relevant abstract tasks can be decomposed. We show how the landmark infor...
متن کاملLandmarks in Oversubscription Planning
In the basic setup of oversubscription planning (OSP), the objective is to achieve an as valuable as possible subset of goals within a fixed allowance of the total action cost (Smith 2004). Continuing from the recent successes in exploiting logical goal-reachability landmarks in classical planning, we develop a framework for exploiting such landmarks in heuristic-search OSP. We show how standar...
متن کاملCost-Optimal Planning with Landmarks
Planning landmarks are facts that must be true at some point in every solution plan. Previous work has very successfully exploited planning landmarks in satisficing (non-optimal) planning. We propose a methodology for deriving admissible heuristic estimates for cost-optimal planning from a set of planning landmarks. The resulting heuristics fall into a novel class of multi-path dependent heuris...
متن کاملEnhancing Planning Heuristic with Landmarks
Recently, landmarks count heuristic can increase the number of problem instances solved and improve the quality of the solutions in satisfying non-optimal planning. In order to make landmarks count heuristic optimal, we give the solution to the overestimate of landmarks count heuristic. We extend landmarks count heuristic without action cost assignments, and prove that the extension of heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2004
ISSN: 1076-9757
DOI: 10.1613/jair.1492